Parallel Data Compression
نویسنده
چکیده
Parallel computing allows software to run faster by using multiple processors and performing multiple computations simultaneously when possible. The majority of general purpose software is designed for sequential machines and does not take advantage of parallel computing. Lossless data compression software like WinZip, gzip, and bzip2, used for compressing any files found on a computer, are designed for sequential machines. The data compression algorithms require a lot of processing power to analyze and then encode the files in a smaller form. Writing a general purpose compressor that can take advantage of parallel computing should greatly reduce the amount of time it requires to compress files, especially large ones. A parallel version of bzip2 shall be created and tested on a dual-processor machine and parallel cluster to determine if and how much speedup is achieved. The bzip2 program was chosen because it achieves very good compression and is available in library and source form, free under a BSD-style license. The limited research papers available on parallel data compression use theoretical algorithms designed to run on impractical parallel machines that do not exist or are very rare in the real world. The idea with the parallel bzip2 compression program is to make a practical parallel compression utility that works with real machines.
منابع مشابه
A Novel Color Image Compression Method Using Eigenimages
Since the birth of multi–spectral imaging techniques, there has been a tendency to consider and process this new type of data as a set of parallel gray–scale images, instead of an ensemble of an n–D realization. Although, even now, some researchers make the same assumption, it is proved that using vector geometries leads to better results. In this paper, first a method is prop...
متن کاملApplication of the Bulk Synchronous Parallel Model in Fractal Image Compression
In this paper we present the results of an investigation into parallel implementations of fractal image compression algorithms. In particular, the research addressed the applicability for this purpose of the new Bulk Synchronous Parallel model, as implemented by the Oxford BSP Toolkit. BSP provides a scalable and predictable framework for developing parallel software, with a reliable and straig...
متن کاملAn investigation of JPEG image and video compression using parallel processing
The problem inherent with any digital image (or digital video) system is the large amount of bandwidth required for transmission or storage. This has driven the research area of image compression to develop more complex algorithms that compress images to lower data rates with better fidelity. One approach that can be used to increase the execution speed of these complex algorithms is through th...
متن کاملParallel Algorithms for Entropy-Coding Techniques
With the explosion of imaging applications, and due to the massive amounts of imagery data, data compression is essential. Lossless compression, also called entropy coding, is of special importance because not only it serves as a stand-alone system for certain applications such as medical imaging, it also is an inherent part of lossy compression. Therefore, fast entropy coding/decoding algorith...
متن کاملEmpirical Speedup Study of Truly Parallel Data
We present an empirical study of novel work-optimal parallel algorithms for Burrows-Wheeler compression and decompression of strings over a constant alphabet. To validate these theoretical algorithms, we implement them on the experimental XMT computing platform developed especially for supporting parallel algorithms at the University of Maryland. We show speedups of up to 25x for compression, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003